An One Step Smoothing Newton Method for a Class of Stochastic Linear Complementarity Problems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems

This paper extends the regularized smoothing Newton method in vector optimization to symmetric cone optimization, which provide a unified framework for dealing with the nonlinear complementarity problem, the second-order cone complementarity problem, and the semidefinite complementarity problem (SCCP). In particular, we study strong semismoothness and Jacobian nonsingularity of the total natura...

متن کامل

Smoothing Newton and Quasi-Newton Methods for Mixed Complementarity Problems

The mixed complementarity problem can be reformulated as a nonsmooth equation by using the median operator. In this paper, we rst study some useful properties of this reformulation and then derive the Chen-Harker-Kanzow-Smale smoothing function for the mixed complementarity problem. On the basis of this smoothing function, we present a smoothing Newton method for solving the mixed complementari...

متن کامل

Smoothing Functions and A Smoothing Newton Method for Complementarity and Variational Inequality Problems

In this paper, we discuss smoothing approximations of nonsmooth functions arising from complementarity and variational inequality problems. We present some new results which are essential in designing Newton-type methods. We introduce several new classes of smoothing functions for nonlinear complementarity problems and order complementarity problems. In particular, in the first time some comput...

متن کامل

An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...

متن کامل

Smoothing Functions and Smoothing Newton Method for Complementarity and Variational Inequality Problems

This paper provides for the first time some computable smoothing functions for variational inequality problems with general constraints. This paper proposes also a new version of the smoothing Newton method and establishes its global and superlinear (quadratic) convergence under conditions weaker than those previously used in the literature. These are achieved by introducing a general definitio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Belgian Mathematical Society - Simon Stevin

سال: 2011

ISSN: 1370-1444

DOI: 10.36045/bbms/1307452083